package dataStructures.index;

//import java.util.ArrayList;
//import java.util.HashMap;


//TODO if the index building process will be too slow, we should consider of building
//some new DAST for mapping between routes to id collection.

//the main idea is to have a tree which represents all possible routes, every node will has a
//list of id's (all xml nodes can be reached via this route) and pointers to children
public class RouteTree {
	
	/*private class RouteTreeNode
	{
		public ArrayList<Integer> nodes = new ArrayList<Integer>();
		public HashMap<String, RouteTreeNode> dec = new HashMap<String, RouteTreeNode>();
		
		//public ArrayList<Integer> GetRouteNodesId(String route)
		//{
			
		//}
	}*/
}
